BtSQL: nested bitemporal relational database query language
نویسندگان
چکیده
A nested bitemporal relational data model and its query language are implemented. The bitemporal atom (BTA) is the fundamental construct to represent temporal data and it contains 5 components: a value, the lower and upper bounds of valid time, and the lower and upper bounds of the recoding time. We consider 2 types of data structures for storing BTAs: 1) string representation and 2) abstract data-type representation. We also develop a preprocessor for translating a bitemporal structured query language (BtSQL) statement into standard SQL statements. The BtSQL includes the select, insert, delete, and update statements of the SQL, extended for bitemporal relational databases. It supports bitemporal, historical, and current context. Bitemporal context is for auditing purposes, historical context is for querying past states of a bitemporal database, and current context is for querying the snapshot state of a bitemporal database. We also evaluate the performance of the 2 alternative implementation methods by considering retrieval, insertion, and update queries.
منابع مشابه
An Algebra for the BiTemporal Nested Data Model
A generalized bitemporal relational data model (BTNM) is formalized for the representation of bitemporal data with nested structure of arbitrary depth. Time is represented by temporal elements. Time-varying attributes are timestamped by taking advantage of the nested feature of the model. Thus, the temporal dimension of the model is expressed by bitemporal nested attributes consisting of atomic...
متن کاملCompilation and Evaluation of Nested Linear Recursions: a Deductive Database Approach
A deductive database system is an extension of a relational database system by supporting a rulebased, more expressive database language while preserving the set-oriented and declarative style of a relational database query language. This thesis studies the implementation and extension of the chain-based compilation and evaluation method, an interesting method for deductive query evaluation. Ou...
متن کاملA Conserative Property of a Nested Relational Query Language
We proposed in [7] a nested relational calculus and a nested relational algebra based on structural recursion [6,5] and on monads [27,16]. In this report, we describe relative set abstraction as our third nested relational query language. This query language is similar to the well known list comprehension mechanism in functional programming languages such as Haskell [ll], Miranda [24], KRC [23]...
متن کاملAn attribute or tuple timestamping in bitemporal relational databases
Much of the research on bitemporal databases has focused on the modeling of time-related data with either attribute or tuple timestamping. While the attribute-timestamping approach attaches bitemporal data to attributes, the tuple-timestamping approach splits the object’s history into several tuples. Although there have been numerous studies on bitemporal data models, there is no work contrasti...
متن کاملQuery shredding: Efficient relational evaluation of queries over nested multisets (extended version)
Nested relational query languages have been explored extensively, and underlie industrial language-integrated query systems such as Microsoft’s LINQ. However, relational databases do not natively support nested collections in query results. This can lead to major performance problems: if programmers write queries that yield nested results, then such systems typically either fail or generate a l...
متن کامل